A Dynamic Search Method for Jobshop Scheduling Using Lagrange Relaxation Method and Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
A Dynamic Search Method for Jobshop Scheduling Using Lagrange Relaxation Method and Genetic Algorithm
This paper deals with an approximate solution method by decomposing a search space dynamically combined with genetic algorithm(GA) and Lagrangian relaxation(LR) method for solving a job-shop scheduling problem. In this method a subspace of a search space is constructed by using information on partial processing order relations between operations which use same resources. We search these subspac...
متن کاملA Method of Solving Scheduling Problems Using Genetic Algorithm with Improved Lagrangian Relaxation Method
The combinational optimization problem, such as scheduling problem, transportation programming, delivery planning, is limited by many conditions and difficult to be resolved [1]. Furthermore, in the case of a large-scale combinational optimization problem, there are many cases that a good solution cannot be obtained even if a human being spends a few days on solving it [2]. However, in recent y...
متن کاملRelaxation labeling using augmented lagrange-hopfield method
A novel relaxation labeling (RL) method is presented based on Augmented Lagrangian multipliers and the graded Hoppeld neural network (ALH). In this method, an RL problem is converted into a constrained optimization problem and solved by using the augmented Lagrangian and Hoppeld techniques. The ALH method yields results comparable to the best of the existing RL algorithms in terms of the optimi...
متن کاملRelaxation labeling using Lagrange-Hopfield method
A novel relaxation labeling (RL) algorithm is proposed. RL is posed as a constrained optimization problem and the solution is found by using the Lagrangian multiplier method and a technique used in the graded Hoppeld neural network. In terms of the optimized objective value, the algorithm performs almost as well as simulated annealing, as shown by the experimental results. Also, the resulting a...
متن کاملMulti Agents approach for Job Shop Scheduling Problem using Genetic Algorithm and Variable Neighborhood Search method
The job shop scheduling is an important and complex problem for a manufacturing system. It is well known and popular problem having (Non-Polynomial) NP-hard characteristic to find the optimal or near optimal solution (schedules) quickly. In job shop scheduling a set of “N” number of jobs are processed through an “M” number of given set of machines. It must be processed in the prescribed order b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1998
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.34.1660